Visibly Irreducible Polynomials over Finite Fields

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Irreducible Polynomials over Finite Fields

As we will see, modular arithmetic aids in testing the irreducibility of polynomials and even in completely factoring polynomials in Z[x]. If we expect a polynomial f(x) is irreducible, for example, it is not unreasonable to try to find a prime p such that f(x) is irreducible modulo p. If we can find such a prime p and p does not divide the leading coefficient of f(x), then f(x) is irreducible ...

متن کامل

Construction of Irreducible Polynomials over Finite Fields

In this paper we investigate some results on the construction of irreducible polynomials over finite fields. Basic results on finite fields are introduced and proved. Several theorems proving irreducibility of certain polynomials over finite fields are presented and proved. Two theorems on the construction of special sequences of irreducible polynomials over finite fields are investigated in de...

متن کامل

Constructing irreducible polynomials over finite fields

We describe a new method for constructing irreducible polynomials modulo a prime number p. The method mainly relies on Chebotarev’s density theorem.

متن کامل

Generators and irreducible polynomials over finite fields

Weil’s character sum estimate is used to study the problem of constructing generators for the multiplicative group of a finite field. An application to the distribution of irreducible polynomials is given, which confirms an asymptotic version of a conjecture of Hansen-Mullen.

متن کامل

The Explicit Construction of Irreducible Polynomials over Finite Fields

For a finite field GF(q) of odd prime power order q, and n > 1, we construct explicitly a sequence of monic irreducible reciprocal polynomials o f degree n2 m (m = 1, 2, 3 . . . . ) over GF(q). It is the analog for fields of odd order of constructions of Wiedemann and of Meyn over GF(2). We also deduce iterated presenn2** tations of GF(q ).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The American Mathematical Monthly

سال: 2020

ISSN: 0002-9890,1930-0972

DOI: 10.1080/00029890.2020.1677103